Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design

Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design

We study the A-optimal design problem where we are given vectors v1, . . . , vn ∈ R, an integer k ≥ d, and the goal is to select a set S of k vectors that minimizes the trace of (∑ i∈S viv > i )−1 . Traditionally, the problem is an instance of optimal design of experiments in statistics (Pukelsheim (2006)) where each vector corresponds to a linear measurement of an unknown vector and the goal i...

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

Design Algorithms for Doppler MTI and Filters (Using Chebyshev Approximation)

THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

Determination of Optimal Sampling Design for Spatial Data Analysis

Extended Abstract. Inferences for spatial data are affected substantially by the spatial configuration of the network of sites where measurements are taken. Consider the following standard data-model framework for spatial data. Suppose a continuous, spatially-varying quantity, Z, is to be observed at a predetermined number, n, of points ....[ To Countinue Click here]